Doubly Perfect Nonlinear Boolean Permutations

نویسنده

  • Laurent Poinsot
چکیده

Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secretkey block ciphers. This choice directly induces the classical version of the differential attack by the use of XOR-kind differences. While very natural, there are many alternatives to the XOR. Each of them inducing a new form for its corresponding differential attack (using the appropriate notion of difference) and therefore block-ciphers need to use S-boxes that are resistant against these nonstandard differential cryptanalysis. In this contribution we study the functions that offer the best resistance against a differential attack based on a finite field multiplication. We also show that in some particular cases, there are robust permutations which offers the best resistant against both multiplication and exponentiation based differential attacks. We call them doubly perfect nonlinear permutations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Equivalent Condition on the Switching Construction of Differentially 4-uniform Permutations on F22k from the Inverse Function

Differentially 4-uniform permutations on F22k with high nonlinearity are often chosen as Substitution boxes in block ciphers. Recently, Qu et al. used the powerful switching method to construct such permutations from the inverse function [9], [10]. More precisely, they studied the functions of the form G(x) = 1 x +f( 1 x ), where f is a Boolean function. They proved that if f is a preferred Boo...

متن کامل

Permutations on F22k

Differentially 4-uniform permutations on F22k with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred functions, to construct a lot of infinite families of such permutations [14]. In this paper, we propose a particular type of Boolean functions to characterize the preferred fu...

متن کامل

Permutations of finite fields with prescribed properties

For cryptographic applications, the behaviour of the difference map is of importance and since there are no perfect nonlinear (PN) permutations, almost perfect nonlinear (APN) permutations have attracted a lot of attention in the last decades. Costas permutations, which are also extreme with respect to the behaviour of their difference maps, were originally introduced in connection with applica...

متن کامل

More Constructions of Differentially 4 - uniform Permutations on F 2 2 k

Differentially 4-uniform permutations on F22k with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred functions, to construct a lot of infinite families of such permutations [14]. In this paper, we propose a particular type of Boolean functions to characterize the preferred fu...

متن کامل

Double-null operators and the investigation of Birkhoff's theorem on discrete lp spaces

Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null  operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1003.4919  شماره 

صفحات  -

تاریخ انتشار 2010